A Normal Form Problem for Unlabeled Boundary NLC Graph Languages

Combinatorial properties of boundary NLC graph languages

Node label controlled (NLC) grammars are graph grammars (operating on node labeled undirected graphs) which rewrite single nodes only and establish connections between the embedded graph and the neighbors of the rewritten node on the basis of the labels of the involved nodes only. They define (possibly infinite) languages of undirected node labeled graphs (or, if we just omit the labels, langua...

Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity

A Boundary Meshless Method for Neumann Problem

Boundary integral equations (BIE) are reformulations of boundary value problems for partial differential equations. There is a plethora of research on numerical methods for all types of these equations such as solving by discretization which includes numerical integration. In this paper, the Neumann problem is reformulated to a BIE, and then moving least squares as a meshless method is describe...

Compact Normal Form for Regular Languages as Xor Automata

The only presently known normal form for a regular language L ∈ Reg is its Minimal Deterministic Automaton MDA(L). We show that a regular language is also characterized by a finite dimension dim(L), which is always smaller than the number |MDA(L)| of states, and often exponentially so. The dimension is also the minimal number of states of all Nondeterministic Xor Automaton (NXA) which accept th...

The incremental satisfiability problem for a two conjunctive normal form

We propose a novel method to review K ` φ when K and φ are both in Conjunctive Normal Forms (CF). We extend our method to solve the incremental satisfiablity problem (ISAT), and we present different cases where ISAT can be solved in polynomial time. Keyword: Satisfiability Problem, Incremental Satisfiability Problem, 2SAT, Entail Propositional Problem, Efficient Satisfiability Instances.